Digging a Hole at Diamond Realty

Hole digging in ensembles of tunneling molecular magnets

Digging the pupfish out of its hole: risk analyses to guide harvest of Devils Hole pupfish for captive breeding

The Devils Hole pupfish is restricted to one wild population in a single aquifer-fed thermal pool in the Desert National Wildlife Refuge Complex. Since 1995 the pupfish has been in a nearly steady decline, where it was perched on the brink of extinction at 35-68 fish in 2013. A major strategy for conserving the pupfish has been the establishment of additional captive or "refuge" populations, bu...

Decomposing and Clique-Coloring (Diamond, Odd-Hole)-Free Graphs

A diamond is a graph on 4 vertices with exactly one pair of non-adjacent vertices, and an odd hole is an induced cycle of odd length. If G,H are graphs, G is H-free if no induced subgraph of G is isomorphic to H. A clique-colouring of G is an assignment of colours to the vertices of G such that no inclusion-wise maximal clique of size at least 2 is monochromatic. We show that every (diamond, od...

Three-dimensional MgB2-type superconductivity in hole-doped diamond.

We substantiate by numerical and analytical calculations that the recently discovered superconductivity below 4 K in 3% boron-doped diamond is caused by electron-phonon coupling of the same type as in MgB2, albeit in three dimensions. Holes at the top of the zone-centered, degenerate sigma-bonding valence-band couple strongly to the optical bond-stretching modes. The increase from two to three ...

Efficiently recognizing, decomposing and triangulating hole- and diamond-free graphs

We show that the atoms by clique separator decomposition of holeand diamond-free graphs are of three simple types: clique, matched co-bipartite or chordal bipartite. We present an O(n) time algorithm to recognize these graphs and decompose them into atoms, whereas this decomposition requires O(nm) time for almost all graph classes. To ensure this good time bound, we use algorithm LexBFS in a no...